Application of Whale Optimization Algorithm (WOA) on Quadratic Knapsack 0-1 Problem
نویسندگان
چکیده
منابع مشابه
The Performance of the Modified Subgradient Algorithm on Solving the 0-1 Quadratic Knapsack Problem
In this study, the performance of the modified subgradient algorithm (MSG) to solve the 0-1 quadratic knapsack problem (QKP) is examined. The MSG is proposed by Gasimov for solving dual problems constructed with respect to sharp Augmented Lagrangian function. The MSG has some important proven properties. For example, it is convergent, and it guarantees the zero duality gap for the problems such...
متن کاملAlienor Method for Solving the 0-1 Quadratic Knapsack Problem
The quadratic knapsack problem (QKP) is the problem of maximizing a quadratic objective function subject to a single knapsack constraint. It is a well-known NP-hard combinatorial problem. In this paper, we examine the use of Alienor method for solving QKP. Alienor method is a new global optimization algorithm based on a simple idea consisting in approximating an n variables function by a single...
متن کاملConstraint Model and Algorithm for the 0 - 1 Knapsack Problem
Today’s economic environment has highlighted the importance of properly optimizing every organization’s asset including space and facilities portfolio. Reducing space cost by using space more efficiently can release funds for other more important activities according to the National Audit Office (NAO) space management in higher education. Utilization rate is a function of a frequency rate and a...
متن کاملA Hypecube Algorithm for the 0/1 Knapsack Problem
Many combinatorial optimization problems are known to be NP-complete. A common point of view is that finding fast algorithms for such problems using polynomial number of processors is unlikely. However facts of this kind usually are established for "worst" case situations and in practice many instances of NP-complete problems are successfully solved in polynomial time by such traditional combin...
متن کاملA Hybrid Quantum-inspired Artificial Bee Colony Algorithm for Combinatorial Optimization Problem: 0-1 Knapsack
This paper propose a new mixture method called Quantum Artificial Bee Colony (QABC) algorithm. QABC is based on some quantum computing concepts, such as qubits and superposition of states. In QABC these quantum concepts are applied on Artificial Bee Colony (ABC) algorithm. ABC is one of the recent algorithms in optimization area that has earned good popularity and some new works based on origin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ZERO: Jurnal Sains, Matematika dan Terapan
سال: 2020
ISSN: 2580-5754,2580-569X
DOI: 10.30829/zero.v4i1.7932